- nearest-neighbour method
- метод (частоты встречаемости) ближайших соседей (в нуклеотидной последовательности)
Англо-русский словарь по иммунологии и иммуногенетике. — М.: Русский язык. Сучков С. В. Под ред. акад. Р. В. Петрова. 1990.
Англо-русский словарь по иммунологии и иммуногенетике. — М.: Русский язык. Сучков С. В. Под ред. акад. Р. В. Петрова. 1990.
Nearest neighbor — may refer to: Nearest neighbor search in pattern recognition and in computational geometry Nearest neighbor interpolation for interpolating data Nearest neighbor graph in geometry The k nearest neighbor algorithm in machine learning, an… … Wikipedia
Nearest-neighbor interpolation — (blue lines) in one dimension on a (uniform) dataset (red points) … Wikipedia
k-nearest neighbor algorithm — KNN redirects here. For other uses, see KNN (disambiguation). In pattern recognition, the k nearest neighbor algorithm (k NN) is a method for classifying objects based on closest training examples in the feature space. k NN is a type of instance… … Wikipedia
Nucleic acid thermodynamics — is the study of the thermodynamics of nucleic acid molecules, or how temperature affects nucleic acid structure. For multiple copies of DNA molecules, the melting temperature (Tm) is defined as the temperature at which half of the DNA strands are … Wikipedia
DNA denaturation — DNA denaturation, also called DNA melting, is the process by which double stranded deoxyribonucleic acid unwinds and separates into single stranded strands through the breaking of hydrogen bonding between the bases. Both terms are used to refer… … Wikipedia
Kd-tree — In computer science, a k d tree (short for k dimensional tree ) is a space partitioning data structure for organizing points in a k dimensional space. k d trees are a useful data structure for several applications, such as searches involving a… … Wikipedia
Scale-invariant feature transform — Feature detection Output of a typical corner detection algorithm … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
crystal — crystallike, adj. /kris tl/, n., adj., v., crystaled, crystaling or (esp. Brit.) crystalled, crystalling. n. 1. a clear, transparent mineral or glass resembling ice. 2. the transparent form of crystallized quartz. 3. Chem., Mineral. a solid body… … Universalium
Crystal — /kris tl/, n. 1. a city in SE Minnesota, near Minneapolis. 25,543. 2. a female given name. * * * I Any solid material whose atoms are arranged in a definite pattern and whose surface regularity reflects its internal symmetry. Each of a crystal s… … Universalium
Resampling — is the digital process of changing the sample rate or dimensions of digital imagery or audio by temporally or areally analysing and sampling the original data.AudioAudio resampling is also called sample rate conversion. This operation in digital… … Wikipedia